Task-dependent Optimal Weight Combinations for Static Embeddings
نویسندگان
چکیده
A variety of NLP applications use word2vec skip-gram, GloVe, and fastText word embeddings. These models learn two sets embedding vectors, but most practitioners only one them, or alternately an unweighted sum both. This is the first study to systematically explore a range linear combinations between second sets. We evaluate these on set six benchmarks including IR, POS-tagging, sentence similarity. show that default are often suboptimal demonstrate 1.0-8.0% improvements. Notably, GloVe’s its least effective combination across tasks. provide theoretical basis for weighting embeddings more than other according algorithm task. apply our findings improve accuracy in cross-lingual alignment navigational knowledge by up 15.2%.
منابع مشابه
Learning Task-specific Bilexical Embeddings
We present a method that learns bilexical operators over distributional representations of words and leverages supervised data for a linguistic relation. The learning algorithm exploits lowrank bilinear forms and induces low-dimensional embeddings of the lexical space tailored for the target linguistic relation. An advantage of imposing low-rank constraints is that prediction is expressed as th...
متن کاملComputing Optimal Embeddings for Planar Graphs
We study the problem of optimizing over the set of all combinatorial embeddings of a given planar graph. At IPCO' 99 we presented a rst characterization of the set of all possible embeddings of a given biconnected planar graph G by a system of linear inequalities. This system of linear inequalities can be constructed recursively using SPQR-trees and a new splitting operation. In general, this a...
متن کاملNonlinear Measurement Combinations for Optimal Operation
Competition, rising energy prices and environmental demands make it increasingly necessary to operate chemical processes as close to optimality as possible. In order to avoid suboptimal performance in presence of disturbances, mainly two approaches are considered for control [3]: On-line and off-line optimization based control. The first approach implies computing the optimal setpoints of the c...
متن کاملOptimal convex combinations bounds of centrodial and harmonic means for logarithmic and identric means
We find the greatest values $alpha_{1} $ and $alpha_{2} $, and the least values $beta_{1} $ and $beta_{2} $ such that the inequalities $alpha_{1} C(a,b)+(1-alpha_{1} )H(a,b)
متن کاملOptimal Sobolev Embeddings on R
The aim of this paper is to study Sobolev-type embeddings and their optimality. We work in the frame of rearrangement-invariant norms and unbounded domains. We establish the equivalence of a Sobolev embedding to the boundedness of a certain Hardy operator on some cone of positive functions. This Hardy operator is then used to provide optimal domain and range rearrangement-invariant norm in the ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Northern European Journal of Language Technology
سال: 2022
ISSN: ['2000-1533']
DOI: https://doi.org/10.3384/nejlt.2000-1533.2022.4438